Descriptional Complexity of Generalized Forbidding Grammars
نویسندگان
چکیده
This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.
منابع مشابه
Descriptional Complexity of Grammars Regulated by Context Conditions
This paper improves several well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated (A) by a context-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals, (B) by a generalized forbidding grammar of degree two with ...
متن کاملMeduna papers pdf
. Title ImageE-Record Title Medical Center-Medicine Psychiatry Ladislas J. Download Box Folder List pdf.It is ironic that Laszlo Meduna and Manfred Sakel made epochal discoveries in psychiatry. I do not believe the original publications have much value anymore.Publications. This page contains my publications from research, school and other areas. Zemek: Regulated Grammars and Automata, Springer...
متن کاملA Note on the Descriptional Complexity of Semi-Conditional Grammars
The descriptional complexity of semi-conditional grammars is studied. A proof that every recursively enumerable language is generlji";'I":ff f iru*::?H:"ffi Xl,?li".ffi f iJ,,-,T?,ll,J"'"'n'"
متن کاملDescriptional complexity of semi-conditional grammars
The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.
متن کاملDescriptional complexity of multi-parallel grammars
This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.
متن کامل